Cartesian product
英 [kɑːˈtiːziən ˈprɒdʌkt]
美 [kɑːrˈtiːziən ˈprɑːdʌkt]
网络 笛卡兒積; 笛卡尔积; 笛卡儿积; 笛卡儿乘积; 笛卡尔乘积
双语例句
- In this paper, A theorem for the binding number of multiple cartesian product of path and circuits is proven, and some limit properties of the binding number of multiple product graphs are presented.
本文证明了路与回路的多重笛卡尔乘积的联结数的一个定理，并给出了若干多重乘积图的联结数的极限性质。 - The Vertex Linear Arboricity of Complete Multiple Graphs and Cartesian Product Graphs
完全多部图和笛卡儿积图的线性点荫度 - Adjacent vertex-distinguishing VE-total coloring of Cartesian product graph of some graphs
部分图笛卡儿积图的邻点可区别VE-全染色 - We now derive, based on the above results, sufficient conditions for a Cartesian product network.
我们现在得出，基于上述结果，有足够的条件，笛卡尔积网络。 - In this paper, a new result of Ky-Fan minimax theorem be obtained in Cartesian product H-space.
文章证明了Caresian乘积H-空间的一个新结果，并应用于ky-Fan极大极小定理的推广。 - Restricted Edge Connectivity of Cartesian Product and Direct Product Graphs
笛卡尔乘积图与直接乘积图的限制边连通性 - It is proved that: ( 1) The cartesian product, the lexicographic product and the strong direct product in the products of connected graphs, are the path-positive graphs.
证明了：（1）如果G1和G2都是连通图，则积图中笛卡尔积，逻辑积和强直积都是道路正图。 - If the number of tuples, calculated by using the Cartesian product, exceeds the set threshold; the NON EMPTY clause is applied to the query.
如果通过使用Cartesian产品计算的元组数超过设定的阈值，将NONEMPTY子句应用于查询。 - The binding number of Cartesian product of complete graphs and complete bipartite graphs
完全图与完全偶图的笛卡尔乘积的联结数 - A Popularize of Venn Diagraph in Cartesian Product
集合笛卡儿积集中文氏图的一种推广